Robust synthesis for real-time systems
نویسندگان
چکیده
منابع مشابه
Robust synthesis for real-time systems
Specification theories for real-time systems allow reasoning about interfaces and their implementation models, using a set of operators that includes satisfaction, refinement, logical and parallel composition. To make such theories applicable throughout the entire design process from an abstract specification to an implementation, we need to reason about the possibility to effectively implement...
متن کاملDelay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملA Robust Control Design Technique for Discrete-Time Systems
A robust state feedback design subject to placement of the closed loop eigenvalues in a prescribed region of unit circle is presented. Quantitative measures of robustness and disturbance rejection are investigated. A stochastic optimization algorithm is used to effect trade-off between the free design parameters and to accomplish all the design criteria. A numerical example is given to illustra...
متن کاملRobust Non-Classical Embedded Real-Time Systems
Non-classical embedded real-time systems are characterised by in comparison to classical hard real-time systems less strict timing but more strict economic constraints. It is not possible to build such systems based on worst-case assumptions, since often, the worst-case to average-case ratio is rather bad. This calls for a new platform. A promising approach is to run an off the shelf non-real-t...
متن کاملRobust Partitioned Scheduling for Real-Time Multiprocessor Systems
In this paper, we consider the problem of fixed-priority partitioned scheduling of sporadic real-time tasks for homogeneous processors. We propose a partitioning heuristic that takes into account possible Worst Case Execution Time (WCET) overruns. Our goal is to maximize the duration a task can be allowed to exceed its WCET without compromising the timeliness constraints of all the tasks. This ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.08.015